Proof-Theory and Semantics for a Theory of Definite Descriptions
نویسندگان
چکیده
This paper presents a sequent calculus and dual domain semantics for theory of definite descriptions in which these expressions are formalised the context complete sentences by binary quantifier I. I forms formula from two formulas. Ix[F, G] means ‘The F is G’. approach has advantage incorporating scope distinctions directly into notation. Cut elimination proved system classical positive free logic with it shown to be sound semantics. The number novel features briefly compared usual formalising ‘the F’ term forming operator. It does not coincide Hintikka’s Lambert’s preferred theories, but divergence well-motivated attractive.
منابع مشابه
Russell’s Theory of Definite Descriptions
The theory of definite descriptions Bertrand Russell presented in “On Denoting” one hundred years ago was instrumental in defining the then newly emerging philosophy of language, but a more remarkable achievement is that this centenarian theory is the currently dominant theory of definite descriptions. But what, ex actly, is this theory? The question needs to be asked because the theory Russell...
متن کاملDefinite Descriptions, Focus Shift, and a Theory of Discourse Interpretation
The model of definite description interpretation in [Poesio, 1993] is revised to avoid the previous theory’s assumption that the interpretation of definites occurs after scope interpretation has taken place. The processes involved in the interpretation of a definite are formalized as DRS construction rules applying in parallel to generate alternative hypotheses out of underspecified representat...
متن کاملClassical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have th...
متن کاملAbstract Normative Systems: Semantics and Proof Theory
Normative Systems: Semantics and Proof Theory Silvano Colombo Tosatto SnT, University of Luxembourg Luxembourg Guido Boella University of Turin Italy Leendert van der Torre University of Luxembourg Luxembourg Serena Villata INRIA France
متن کاملLogic programming : operational semantics and proof theory
Downloading the book in this website lists can give you more advantages. It will show you the best book collections and completed collections. So many books can be found in this website. So, this is not only this logic programming operational semantics and proof theory. However, this book is referred to read because it is an inspiring book to give you more chance to get experiences and also tho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86059-2_6